Discrete approximations for strict convex continuous time problems and duality
نویسندگان
چکیده
منابع مشابه
Convexity and convex approximations of discrete-time stochastic control problems with constraints
We investigate constrained optimal control problems for linear stochastic dynamical systems evolving in discrete time. We consider minimization of an expected value cost subject to probabilistic constraints. We study the convexity of a finite-horizon optimization problem in the case where the control policies are affine functions of the disturbance input. We propose an expectation-based method ...
متن کاملContinuous Convex Sets and Zero Duality Gap for Convex Programs
This article uses classical notions of convex analysis over euclidean spaces, like Gale & Klee’s boundary rays and asymptotes of a convex set, or the inner aperture directions defined by Larman and Brøndsted for the same class of sets, to provide a new zero duality gap criterion for ordinary convex programs. On this ground, we are able to characterize objective functions and respectively feasib...
متن کاملMartingale approximations for continuous-time and discrete-time stationary Markov processes
We show that the method of Kipnis and Varadhan (Comm. Math. Phys. 104 (1986) 1) to construct a martingale approximation to an additive functional of a stationary ergodic Markov process via the resolvent is universal in the sense that a martingale approximation exists if and only if the resolvent representation converges. A sufficient condition for the existence of a martingale approximation is ...
متن کاملWEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS
The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...
متن کاملNew results for discrete-continuous mean flow time scheduling problems
The problem of scheduling n jobs under discrete-continuous resources to minimise the mean flow time is revisited. The job's processing rate is a continuous increasing function fi , i = 1,..., n of the amount of the discrete resource allotted to this job at a time. The problem can be solved in polynomial time if fi = f, i = 1, ..., n. New results concerning the optimal resource allocation for pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational & Applied Mathematics
سال: 2004
ISSN: 0101-8205
DOI: 10.1590/s0101-82052004000100005